A linear lower bound on the unbounded error probabilistic communication complexity
نویسندگان
چکیده
منابع مشابه
A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity
The Program Committee of the 2001 Conference on Computational Complexity is happy to present the Ron Book Prize for Best Student Paper to Juergen Forster of the Ruhr-Universitaet, Bochum, Germany. The award is given annually to the most outstanding paper written solely by one or more students. The paper selected by the Complexity Program Committee is Complexity 2001 Ron Book Prize for Best Stud...
متن کاملUnbounded-Error Classical and Quantum Communication Complexity
Since the seminal work of Paturi and Simon [26, FOCS’84 & JCSS’86], the unboundederror classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently, [14, ICALP’07] found that the unboundederror quantum communication complexity in the one-way communication model can also be investigated using the arrangement, and showed th...
متن کاملUnbounded-Error Communication Complexity of Symmetric Functions
The sign-rank of a real matrix M is the least rank of a matrix R in which every entry has the same sign as the corresponding entry of M.We determine the sign-rank of every matrix of the form M = [ D(|x ∧ y|) ]x,y, where D : {0, 1, . . . , n} → {−1,+1} is given and x and y range over {0, 1}n . Specifically, we prove that the sign-rank of M equals 22̃(k), where k is the number of times D changes s...
متن کاملA Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
We study the communication complexity of single-server Private Information Retrieval (PIR) protocols that are based on fundamental cryptographic primitives in a black-box manner. In this setting, we establish a tight lower bound on the number of bits communicated by the server in any polynomially-preserving construction that relies on trapdoor permutations. More specifically, our main result st...
متن کاملA Lower Bound on Entanglement-Assisted Quantum Communication Complexity
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2002
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(02)00019-3